By using SIAM Journals Online you agree to abide by the
Terms and Conditions of Use.

©  SIAM

 

SIAM Journal on Computing

Table of Contents
Volume 19, Issue 2, pp. 207-409

Please Note: Electronic articles are available well in advance of the printed articles.

What Article options are available ?   View Cart   

Reversal Complexity Classes for Alternating Turing Machines

Miroslaw Kutylowski, Maciej Liskiewicz, and Krzysztof Lorys

pp. 207-221

The Complexity of File Transfer Scheduling with Forwarding

Jennifer Whitehead

pp. 222-245

Characterization of Associative Operations with Prefix Circuits of Constant Depth and Linear Size

G. Bilardi and F. P. Preparata

pp. 246-255

A Time-Randomness Trade-Off for Oblivious Routing

David Peleg and Eli Upfal

pp. 256-266

A Heuristic Algorithm for Small Separators in Arbitrary Graphs

David A. Plaisted

pp. 267-280

On the Efficient Generation of Language Instances

Laura A. Sanchis and Mark A. Fulk

pp. 281-296

Red-Blue Intersection Detection Algorithms, with Applications to Motion Planning and Collision Detection

Pankaj K. Agarwal and Micha Sharir

pp. 297-321

Towards an Architecture-Independent Analysis of Parallel Algorithms

Christos H. Papadimitriou and Mihalis Yannakakis

pp. 322-328

Addition Machines

Robert W. Floyd and Donald E. Knuth

pp. 329-340

Semantic Correctness for a Parallel Object-Oriented Language

J. J. M. M. Rutten

pp. 341-383

On the Decomposability of $NC$ and $AC$

Christopher B. Wilson

pp. 384-396

Parallel Depth-First Search in General Directed Graphs

Alok Aggarwal, Richard J. Anderson, and Ming-Yang Kao

pp. 397-409